Experimental and analytical studies of a model helicopter rotor in hover

A benchmark test to aid the development of various rotor performance codes was conducted. Simultaneous blade pressure measurements and tip vortex surveys were made for a wide range of tip Mach numbers including the transonic flow regime. The measured tip vortex strength and geometry permit effective blade loading predictions when used as input to a prescribed wake lifting surface code. It is also shown that with proper inflow and boundary layer modeling, the supercritical flow regime can be accurately predicted

Finite difference modeling of rotor flows including wake effects

Rotary wing finite difference methods are investigated. The main concern is the specification of boundary conditions to properly account for the effect of the wake on the blade. Examples are given of an approach where wake effects are introduced by specifying an equivalent angle of attack. An alternate approach is also given where discrete vortices are introduced into the finite difference grid. The resulting computations of hovering and high advance ratio cases compare well with experiment. Some consideration is also given to the modeling of low to moderate advance ratio flows

An experimental investigation of the parallel blade-vortex interaction

A scheme for investigating the parallel blade vortex interaction (BVI) has been designed and tested. The scheme involves setting a vortex generator upstream of a nonlifting rotor so that the vortex interacts with the blade at the forward azimuth. The method has revealed two propagation mechanisms: a type C shock propagation from the leading edge induced by the vortex at high tip speeds, and a rapid but continuous pressure pulse associated with the proximity of the vortex to the leading edge. The latter is thought to be the more important source. The effects of Mach number and vortex proximity are discussed

The structure of trailing vortices generated by model rotor blades

Hot-wire anemometry to analyze the structure and geometry of rotary wing trailing vortices is studied. Tests cover a range of aspect ratios and blade twist. For all configurations, measured vortex strength correlates well with maximum blade-bound circulation. Measurements of wake geometry are in agreement with classical data for high-aspect ratios. The detailed vortex structure is similar to that found for fixed wings and consists of four well defined regions--a viscous core, a turbulent mixing region, a merging region, and an inviscid outer region. A single set of empirical formulas for the entire set of test data is described

Thermoelastic Noise and Homogeneous Thermal Noise in Finite Sized Gravitational-Wave Test Masses

An analysis is given of thermoelastic noise (thermal noise due to thermoelastic dissipation) in finite sized test masses of laser interferometer gravitational-wave detectors. Finite-size effects increase the thermoelastic noise by a modest amount; for example, for the sapphire test masses tentatively planned for LIGO-II and plausible beam-spot radii, the increase is less than or of order 10 per cent. As a side issue, errors are pointed out in the currently used formulas for conventional, homogeneous thermal noise (noise associated with dissipation which is homogeneous and described by an imaginary part of the Young's modulus) in finite sized test masses. Correction of these errors increases the homogeneous thermal noise by less than or of order 5 per cent for LIGO-II-type configurations.Comment: 10 pages and 3 figures; RevTeX; submitted to Physical Review

Leptoproduction of heavy quarks

There are presently two approaches to calculating heavy quark production for the deeply inelastic scattering process in current literature. The conventional fixed-flavor scheme focuses on the flavor creation mechanism and includes the heavy quark only as a final state particle in the hard scattering cross section; this has been computed to next-to-leading order--\alphas^2. The more recently formulated variable-flavor scheme includes, in addition, the flavor excitation process where the initial state partons of all flavors contribute above their respective threshold, as commonly accepted for calculations of other high energy processes; this was initially carried out to leading order--\alphas^1. We first compare and contrast these existing calculations. As expected from physical grounds, the next-to-leading-order fixed-flavor scheme calculation yields good results near threshold, while the leading-order variable-flavor scheme calculation works well for asymptotic Q^2. The quality of the calculations in the intermediate region is dependent upon the x and Q^2 values chosen. An accurate self-consistent QCD calculation over the entire range can be obtained by extending the variable-flavor scheme to next-to-leading-order. Recent work to carry out this calculation is described. Preliminary numerical results of this calculation are also presented for comparison

Semi-automatic assessment of unrestrained Java code: a Library, a DSL, and a workbench to assess exams and exercises

© ACM 2015. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in http://dx.doi.org/10.1145/2729094.2742615Automated marking of multiple-choice exams is of great interest in university courses with a large number of students. For this reason, it has been systematically implanted in almost all universities. Automatic assessment of source code is however less extended. There are several reasons for that. One reason is that almost all existing systems are based on output comparison with a gold standard. If the output is the expected, the code is correct. Otherwise, it is reported as wrong, even if there is only one typo in the code. Moreover, why it is wrong remains a mystery. In general, assessment tools treat the code as a black box, and they only assess the externally observable behavior. In this work we introduce a new code assessment method that also verifies properties of the code, thus allowing to mark the code even if it is only partially correct. We also report about the use of this system in a real university context, showing that the system automatically assesses around 50% of the work.This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de Economíay Competitividad (Secretaría de Estado de Investigación, Desarrollo e Innovación) under grant TIN2013-44742-C4-1-R and by the Generalitat Valenciana under grant PROMETEOII2015/013. David Insa was partially supported by the Spanish Ministerio de Educación under FPU grant AP2010-4415.Insa Cabrera, D.; Silva, J. (2015). Semi-automatic assessment of unrestrained Java code: a Library, a DSL, and a workbench to assess exams and exercises. ACM. https://doi.org/10.1145/2729094.2742615SK. A Rahman and M. Jan Nordin. A review on the static analysis approach in the automated programming assessment systems. In National Conference on Programming 07, 2007.K. Ala-Mutka. A survey of automated assessment approaches for programming assignments. In Computer Science Education, volume 15, pages 83--102, 2005.C. Beierle, M. Kula, and M. Widera. Automatic analysis of programming assignments. In Proc. der 1. E-Learning Fachtagung Informatik (DeLFI '03), volume P-37, pages 144--153, 2003.J. Biggs and C. Tang. Teaching for Quality Learning at University : What the Student Does (3rd Edition). In Open University Press, 2007.P. Denny, A. Luxton-Reilly, E. Tempero, and J. Hendrickx. CodeWrite: Supporting student-driven practice of java. In Proceedings of the 42nd ACM technical symposium on Computer science education, pages 09--12, 2011.R. Hendriks. Automatic exam correction. 2012.P. Ihantola, T. Ahoniemi, V. Karavirta, and O. Seppala. Review of recent systems for automatic assessment of programming assignments. In Proceedings of the 10th Koli Calling International Conference on Computing Education Research, pages 86--93, 2010.H. Kitaya and U. Inoue. An online automated scoring system for Java programming assignments. In International Journal of Information and Education Technology, volume 6, pages 275--279, 2014.M.-J. Laakso, T. Salakoski, A. Korhonen, and L. Malmi. Automatic assessment of exercises for algorithms and data structures - a case study with TRAKLA2. In Proceedings of Kolin Kolistelut/Koli Calling - Fourth Finnish/Baltic Sea Conference on Computer Science Education, pages 28--36, 2004.Y. Liang, Q. Liu, J. Xu, and D. Wang. The recent development of automated programming assessment. In Computational Intelligence and Software Engineering, pages 1--5, 2009.K. A. Naudé, J. H. Greyling, and D. Vogts. Marking student programs using graph similarity. In Computers & Education, volume 54, pages 545--561, 2010.A. Pears, S. Seidman, C. Eney, P. Kinnunen, and L. Malmi. Constructing a core literature for computing education research. In SIGCSE Bulletin, volume 37, pages 152--161, 2005.F. Prados, I. Boada, J. Soler, and J. Poch. Automatic generation and correction of technical exercices. In International Conference on Engineering and Computer Education (ICECE 2005), 2005.M. Supic, K. Brkic, T. Hrkac, Z. Mihajlovic, and Z. Kalafatic. Automatic recognition of handwritten corrections for multiple-choice exam answer sheets. In Information and Communication Technology, Electronics and Microelectronics (MIPRO), pages 1136--1141, 2014.S. Tung, T. Lin, and Y. Lin. An exercise management system for teaching programming. In Journal of Software, 2013.T. Wang, X. Su, Y. Wang, and P. Ma. Semantic similarity-based grading of student programs. In Information and Software Technology, volume 49, pages 99--107, 2007